discrete-exponentiation cryptosystem
- discrete-exponentiation cryptosystem
криптосистема на основе дискретного экспоненцирования (возведения в степень)
криптосистема на основе дискретного экспоненцирования (возведения в степень)
Англо-русский словарь по компьютерной безопасности.
Академик.ру.
2011.
Смотреть что такое "discrete-exponentiation cryptosystem" в других словарях:
Public-key cryptography — In an asymmetric key encryption scheme, anyone can encrypt messages using the public key, but only the holder of the paired private key can decrypt. Security depends on the secrecy of that private key … Wikipedia
Three-pass protocol — In cryptography, the three pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without the need to exchange or distribute encryption keys. This message protocol should not be… … Wikipedia
ElGamal encryption — In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public key cryptography which is based on the Diffie Hellman key agreement. It was described by Taher Elgamal in 1984 [Taher ElGamal, A Public Key… … Wikipedia
Cryptography — Secret code redirects here. For the Aya Kamiki album, see Secret Code. Symmetric key cryptography, where the same key is used both for encryption and decryption … Wikipedia
Elliptic curve cryptography — (ECC) is an approach to public key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[1] and Victor S. Miller[2] in 1985.… … Wikipedia
Elliptic Curve Cryptography — Elliptische Kurve über Unter Elliptic Curve Cryptography (ECC) oder deutsch Elliptische Kurven Kryptographie versteht man asymmetrische Kryptosysteme, die Operationen auf elliptischen Kurven über endlichen Körpern v … Deutsch Wikipedia
Computational Diffie-Hellman assumption — The computational Diffie Hellman (CDH) assumption is the assumption that a certain computational problem within a cyclic group is hard.Consider a cyclic group {mathbb G} of order q. The CDH assumption states that, given :(g,g^a,g^b) for a… … Wikipedia
Trapdoor function — A trapdoor function is a function that is easy to compute in one direction, yet believed to be difficult to compute in the opposite direction (finding its inverse) without special information, called the trapdoor . Trapdoor functions are widely… … Wikipedia
LUC (cryptographie) — LUC est un algorithme asymétrique de cryptographie à clé publique, basé sur les suites de Lucas. Ce cryptosystème a été développé par des chercheurs d Australie et de Nouvelle Zélande, principalement P. Smith and C. Skinner. Le chiffrement est… … Wikipédia en Français
Luc (cryptographie) — LUC est un algorithme asymétrique de cryptographie à clé publique, basé sur les suites de Lucas. Ce cryptosystème a été développé par des chercheurs d Australie et de Nouvelle Zélande, principalement P. Smith and C. Skinner. Le chiffrement est… … Wikipédia en Français
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia